A Verifiable Multi-Secret Sharing Scheme Based on Short Integer Solution

With the possible birth of quantum computer, traditional secret sharing schemes have been unable to meet security requirements. We proposed a new verifiable multi-secret scheme based on short integer solution problem. By utilizing symmetric binary polynomial, $k$ secrets and shares can be generated, then we convert into string xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbb{Z}_{q}$ , which identified by one-way anti-collision hash function lattice, so that multiple reconstructed safely. The advantages mainly focus verifiability without interaction in distribution phase less memory requirement. In scheme, prevents dealer share wrong forces participants submit their correctly. Meanwhile, reduced, means is improved. releasing public values inevitable, this paper has size per reduce pressure consumption proper parameters. end, it also effectively resist attack.